The cone of supermodular games on finite distributive lattices
نویسندگان
چکیده
منابع مشابه
Supermodular Functions on Finite Lattices
The supermodular order on multivariate distributions has many applications in financial and actuarial mathematics. In the particular case of finite, discrete distributions, we generalize the order to distributions on finite lattices. In this setting, we focus on the generating cone of supermodular functions because the extreme rays of that cone (modulo the modular functions) can be used as test...
متن کاملThe Core of Games on Distributive Lattices
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in cooperative game theory is the core of the game, as it contains the rational imputations for players. We propose two definitions for the core of a distributive game, the first one is called the precore and is a direct general...
متن کاملOn the Representation of Finite Distributive Lattices
Classical results of Birkhoff and of Dilworth yield an extremely useful representation of a finite distributive lattice L as the downset lattice D(JL) of poset JL of join-irreducible elements of L. Through this they get a correspondence between the chain decompositions of JL and the tight embeddings of L into a product of chains. We use a simple but elegant result of Rival which characterizes s...
متن کاملOn (finite) distributive lattices with antitone involutions
Some well-known algebras of logic or other algebraic models of non-classical reasoning, such as MV-algebras or orthomodular lattices, can be regarded as lattices with antitone involutions, i.e., bounded lattices with the property that all principal filters (or ideals) are equipped with antitone involutions. This simple observation is behind the so-called “basic algebras” that were introduced in...
متن کاملComplete Valuations on Finite Distributive Lattices
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.01.024